Link Gain Matrix Estimation in Distributed Large-Scale Wireless Networks

نویسندگان

  • Jing Lei
  • Larry J. Greenstein
  • Roy D. Yates
چکیده

Motivation (1) Distributed wireless networks arise in various forms. (2) Knowledge of the link gain matrix can be highly valuable in planning and using large-scale distributed wireless networks. (3) If the number N of radio nodes is large, measuring N(N1)/2 node-to-node link gains can be prohibitive.  This motivates us to devise a methodology that measures a fraction of the links and accurately estimates the rest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

Impacts of the Negative-exponential and the K-distribution modeled FSO turbulent links on the theoretical and simulated performance of the distributed diffusion networks

Merging the adaptive networks with the free space optical (FSO) communication technology is a very interesting field of research because by adding the benefits of this technology, the adaptive networks become more efficient, cheap and secure. This is due to the fact that FSO communication uses unregistered visible light bandwidth instead of the overused radio spectrum. However, in spite of all ...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • EURASIP J. Wireless Comm. and Networking

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010